16 research outputs found
How to obtain lattices from (f,σ,δ)-codes via a generalization of Construction A
We show how cyclic (f,σ,δ)-codes over finite rings canonically induce a Z-lattice in RN by using certain quotients of orders in nonassociative division algebras defined using the skew polynomial f. This construction generalizes the one using certain σ-constacyclic codes by Ducoat and Oggier, which used quotients of orders in non-commutative associative division algebras defined by f, and can be viewed as a generalization of the classical Construction A for lattices from linear codes. It has the potential to be applied to coset coding, in particular to wire-tap coding. Previous results by Ducoat and Oggier are obtained as special cases
Graded transcendental extensions of graded fields
We study transcendency properties for graded field extension and
give an application to valued field extensions